Building Argumentation Systems on Set Constraint Logic

The purpose of this paper is to show how the theory of probabilistic argumentation systems can be extended from propositional logic to the more general framework of set constraint logic. The strength of set constraint logic is that logical relations between non-binary variables can be expressed more directly. This simplifies the classical way of modeling knowledge through propositional logic. Building argumentation systems on set constraint logic is therefore useful for improving its capabilities of expressing different forms of uncertain knowledge.